Learned Factor Graphs for Inference From Stationary Time Sequences

نویسندگان

چکیده

The design of methods for inference from time sequences has traditionally relied on statistical models that describe the relation between a latent desired sequence and observed one. A broad family model-based algorithms have been derived to carry out at controllable complexity using recursive computations over factor graph representing underlying distribution. An alternative model-agnostic approach utilizes machine learning (ML) methods. Here we propose framework combines data-driven ML tools stationary sequences. In proposed approach, neural networks are developed separately learn specific components describing distribution sequence, rather than complete task. By exploiting properties this distribution, resulting can be applied varying temporal duration. Learned graphs realized compact trainable small training sets, or alternatively, used improve upon existing deep systems. We present an algorithm based learned graphs, which learns implement sum-product scheme labeled data, different lengths. Our experimental results demonstrate ability sets accurate sleep stage detection Sleep-EDF dataset, as well symbol in digital communications with unknown channels.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nonparametric inference for ergodic, stationary time series

Nonparametric inference for ergodic, stationary time series. Abstract The setting is a stationary, ergodic time series. The challenge is to construct a sequence of functions, each based on only finite segments of the past, which together provide a strongly consistent estimator for the conditional probability of the next observation, given the infinite past. Ornstein gave such a construction for...

متن کامل

Simultaneous Quantile Inference for Non-stationary Long-memory Time Series

We consider the simultaneous or functional inference of time-varying quantile curves for a class of non-stationary long-memory time series. New uniform Bahadur representations and Gaussian approximation schemes are established for a broad class of non-stationary long-memory linear processes. Furthermore, an asymptotic distribution theory is developed for the maxima of a class of non-stationary ...

متن کامل

Distributed Parallel Inference on Large Factor Graphs

As computer clusters become more common and the size of the problems encountered in the field of AI grows, there is an increasing demand for efficient parallel inference algorithms. We consider the problem of parallel inference on large factor graphs in the distributed memory setting of computer clusters. We develop a new efficient parallel inference algorithm, DBRSplash, which incorporates ove...

متن کامل

Inference for modulated stationary processes.

We study statistical inferences for a class of modulated stationary processes with time-dependent variances. Due to non-stationarity and the large number of unknown parameters, existing methods for stationary or locally stationary time series are not applicable. Based on a self-normalization technique, we address several inference problems, including self-normalized central limit theorem, self-...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Signal Processing

سال: 2022

ISSN: ['1053-587X', '1941-0476']

DOI: https://doi.org/10.1109/tsp.2021.3139506